Network community partition based on intelligent clustering algorithm

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A partition-based algorithm for clustering large-scale software systems

Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...

متن کامل

Spatial Clustering Algorithm Based on Hierarchical-Partition Tree

In spatial clustering, the scale of spatial data is usually very large. Spatial clustering algorithms need high performance, good scalability, and are able to deal with noise and multidimensional data. In this paper, we propose a rapid spatial clustering algorithm based on hierarchical-partition tree. The proposed algorithm partitions spatial data into subsets by simple arithmetical calculation...

متن کامل

An Improved Clustering Algorithm based on Intelligent Computing

Clustering technology has received a lot of concern in many areas such as engineering, medicine, biology and data mining. Collecting data points is the purpose of clustering and the most common clustering technology is K-means algorithm. However, results of kmeans depend on the initial state and convergence to a local optimum is also its drawback. To overcome these drawbacks, many studies have ...

متن کامل

Hybrid Intelligent Systems ADAPTIVE GUSTAFSON-KESSEL FUZZY CLUSTERING ALGORITHM BASED ON SELF-LEARNING SPIKING NEURAL NETWORK

The Gustafson-Kessel fuzzy clustering algorithm is capable of detecting hyperellipsoidal clusters of different sizes and orientations by adjusting the covariance matrix of data, thus overcoming the drawbacks of conventional fuzzy c-means algorithm. In this paper, an adaptive version of the Gustafson-Kessel algorithm is proposed. The way to adjust the covariance matrix iteratively is introduced ...

متن کامل

ON FUZZY NEIGHBORHOOD BASED CLUSTERING ALGORITHM WITH LOW COMPLEXITY

The main purpose of this paper is to achieve improvement in thespeed of Fuzzy Joint Points (FJP) algorithm. Since FJP approach is a basisfor fuzzy neighborhood based clustering algorithms such as Noise-Robust FJP(NRFJP) and Fuzzy Neighborhood DBSCAN (FN-DBSCAN), improving FJPalgorithm would an important achievement in terms of these FJP-based meth-ods. Although FJP has many advantages such as r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Optics

سال: 2020

ISSN: 2412-6179,0134-2452

DOI: 10.18287/2412-6179-co-724